Efficient algorithms for travelling salesman problems arising in warehouse order picking

Title: Efficient algorithms for travelling salesman problems arising in warehouse order picking
Creator: Charkhgard, H.; Savelsbergh, M.
Relation: ANZIAM Journal Vol. 57, Issue 2, p. 166-174
Publisher Link: http://dx.doi.org/10.1017/S1446181115000140
Publisher: Cambridge University Press
Resource Type: journal article
Date: 2015
Description: We investigate two routing problems that arise when order pickers traverse an aisle in a warehouse. The routing problems can be viewed as Euclidean travelling salesman problems with points on two parallel lines. We show that if the order picker traverses only a section of the aisle and then returns, then an optimal solution can be found in linear time, and if the order picker traverses the entire aisle, then an optimal solution can be found in quadratic time. Moreover, we show how to approximate the routing cost in linear time by computing a minimum spanning tree for the points on the parallel lines.
Subject: order batching; order picking; picker routing; travelling salsman problem; minimum spanning tree problem
Identifier: http://hdl.handle.net/1959.13/1319620
Identifier: uon:23918
Identifier: ISSN:1446-1811
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format